/**
 * Copyright (c) 2020-2024, huli.com
 * All rights reserved.
 */
package com.xiaohujr.xuexue.leetcode.array;

/**
 * @author Xue Xue (xuexue1@huli.com)
 * @version 1.0
 * @since 2020/12/18
 */
public class Q867 {
    public int[][] transpose(int[][] A) {
        int H = A.length;
        int L = A[0].length;
        int[][] result = new int[L][H];
        for (int i = 0; i < H; ++i) {
            for (int j = 0; j < L; ++j) {
                result[j][i] = A[i][j];
            }
        }
        return result;
    }

}
